Computing expectations with continuous p-boxes: Univariate case

نویسندگان

  • Lev V. Utkin
  • Sébastien Destercke
چکیده

Given an imprecise probabilistic model over a continuous space, computing lower/upper expectations is often computationally hard to achieve, even in simple cases. Because expectations are essential in decision making and risk analysis, tractable methods to compute them are crucial in many applications involving imprecise probabilistic models. We concentrate on p-boxes (a simple and popular model), and on the computation of lower expectations of non-monotone functions. This paper is devoted to the univariate case, that is where only one variable has uncertainty. We propose and compare two approaches : the first using general linear programming, and the second using the fact that p-boxes are special cases of random sets. We underline the complementarity of both approaches, as well as the differences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Few Characterizations of the Univariate Continuous Distributions

Various characterizations of distributions, in their generality, are presented in terms of the conditional expectations. Some special  examples are given as well.

متن کامل

Improved algorithms for solving bivariate systems via Rational Univariate Representations

Given two coprime polynomials P and Q in Z[x, y] of degree bounded by d and bitsize bounded by τ , we address the problem of solving the system {P,Q}. We are interested in certified numerical approximations or, more precisely, isolating boxes of the solutions. We are also interested in computing, as intermediate symbolic objects, rational parameterizations of the solutions, and in particular Ra...

متن کامل

Rendezvous-evasion search in two boxes with incomplete information

An agent (who may or may not want to be found) is located in one of two boxes. At time 0 suppose that he is in box B. With probability p he wishes to be found, in which case he has been asked to stay in box B. With probability 1−p he tries to evade the searcher, in which case he may move between boxes A and B. The searcher looks into one of the boxes at times 1, 2, 3, . . .. Between each search...

متن کامل

On the Topology of Real Algebraic Plane Curves

We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given coordinate system even if the curve is not in generic position. Previous methods based on the cylind...

متن کامل

Continuous Collision Detection for Elliptic Disks

Collision detection and avoidance is important for various tasks in robotics. Compared with commonly used circular disks, elliptic disks provide compact shape representation for robots or other vehicles confined to move in the 2D plane. Furthermore, elliptic disks allow simpler analytic representation than rectangular boxes do; this makes it easier to perform continuous collision detection. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2009